rcss: Subgradient and duality approach for dynamic programming
نویسندگان
چکیده
This short paper gives an introduction to the \emph{rcss} package. The R package \emph{rcss} provides users with a tool to approximate the value functions in the Bellman recursion using convex piecewise linear functions formed using operations on tangents. A pathwise method is then used to gauge the quality of the numerical results.
منابع مشابه
An Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملConvex Analysis and Stochastic Programming Exam Program Material Discussed during the Lessons Complements and Errata
1. Exam program 1 2. Lesson 1 (Jan. 20, 2015): Convex functions 2 3. Lesson 2 (Feb. 3, 2015): Convex duality 2 4. Lesson 3 (Feb. 10, 2015): Subgradient of expectations I 2 5. Lesson 4 (Feb. 17, 2015): Subgradient of expectations II 3 6. Lesson 5 (March 3, 2015) 3 7. Lesson 6 (March 17, 2015) 3 8. Lesson 7 (March 24, 2015) 3 9. Lesson 8 (last lesson: March 31, 2015) 3 10. Additional material 3 1...
متن کاملDynamic Subgradient Methods
Lagrangian relaxation is commonly used to generate bounds for mixed-integer linear programming problems. However, when the number of dualized constraints is very large (exponential in the dimension of the primal problem), explicit dualization is no longer possible. In order to reduce the dual dimension, different heuristics were proposed. They involve a separation procedure to dynamically selec...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملExponential membership function and duality gaps for I-fuzzy linear programming problems
Fuzziness is ever presented in real life decision making problems. In this paper, we adapt the pessimistic approach tostudy a pair of linear primal-dual problem under intuitionistic fuzzy (I-fuzzy) environment and prove certain dualityresults. We generate the duality results using exponential membership and non-membership functions to represent thedecision maker’s satisfaction and dissatisfacti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1801.06029 شماره
صفحات -
تاریخ انتشار 2018